Efficient sampling strategies for relational database operations
نویسندگان
چکیده
منابع مشابه
Tensor - Relational Model ( TRM ) for Efficient Tensor - Relational Operations
Multidimensional data have various representations. Thanks to their simplicity in modeling multidimensional data and the availability of various mathematical tools (such as tensor decompositions) that support multi-aspect analysis of such data, tensors are increasingly being used in many application domains including scientific data management, sensor data management, and social network data an...
متن کاملUsing UML to model relational database operations
Abstract The Unified Modeling Language (UML) is being used as the de-facto standard in the software industry. With the adoption of UML 2.0, the new enhancements allow this version to describe many of the elements found in today’s software technology as well as Model Driven Architecture and Service-Oriented Architecture. Although OMG has released several UML Profiles to tailor the language to sp...
متن کاملExtending LOGFLOW with Parallel Relational Database Operations
LOGFLOW is a parallel Prolog system. It is similar to recent parallel database systems concerning its dataflow execution model and its capability of running on shared–nothing architectures. The similarities between LOGFLOW and parallel database systems show that a new database system can be developed based on LOGFLOW in that both relational and deductive queries can be executed. In this paper w...
متن کاملTesting relational database query optimization strategies
Query optimization is one of the most important problems in databases. Query optimization can be talked about in different scenarios with different tools and different results. In this paper we’ll talk about query processing and optimization and test strategies in different context, starting from simple queries continuing with correlated queries, joins with or without different indexing strateg...
متن کاملEfficient Sampling in Relational Feature Spaces
State-of-the-art algorithms implementing the ‘extended transformation approach’ to propositionalization use backtrack depth first search for the construction of relational features (first order atom conjunctions) complying to user’s mode/type declarations and a few basic syntactic conditions. As such they incur a complexity factor exponential in the maximum allowed feature size. Here I present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90224-h